On a Generalization of Schönhardt’s Polyhedron
نویسنده
چکیده
We show that the nonconvex twisted prism over an n-gon cannot be triangulated without new vertices. For this, it does not matter what the coordinates of the n-gon are as long as the top and the bottom n-gon are congruent and the twist is not too large. This generalizes Schönhardt’s polyhedron, which is the nonconvex twisted prism over a triangle.
منابع مشابه
Inverse feasible problem
In many infeasible linear programs it is important to construct it to a feasible problem with a minimum pa-rameters changing corresponding to a given nonnegative vector. This paper defines a new inverse problem, called “inverse feasible problem”. For a given infeasible polyhedron and an n-vector a minimum perturba-tion on the parameters can be applied and then a feasible polyhedron is concluded.
متن کاملA Generalization of Danilov’s Vanishing Theorem
We treat a generalization of Danilov’s vanishing theorem on toric polyhedra. A toric polyhedron is a reduced closed subscheme of a toric variety that are partial unions of the orbits of the torus action. We also give a proof of the E1-degeneration of Hodge to de Rham type spectral sequence for toric polyhedra in any characteristic.
متن کاملA Polynomial Algorithm for Enumerating All Vertices of a Base Polyhedron
In general, it is difficult to enumerate all vertices of a polytope in polynomial time. Here we present a polynomial algorithm which enumerates all vertices of a submodular base polyhedron in O(n31V)) time and in 0 ( n 2 ) space, where V is the vertex set of a base polyhedron and n the dimension of the underlying Euclidean space. Our algorithm is also polynomial delay, and a generalization of s...
متن کاملConvergence of a Generalized Midpoint Iteration
We give an analytic proof for the Hausdorff convergence of the midpoint or derived polygon iteration. We generalize this iteration scheme and prove that the generalization converges to a region of positive area and becomes dense in that region. We speculate on the centroid or derived polyhedron iteration.
متن کاملAn Algorithmic Proof for the Induction of M-convex Functions through Networks
Quite recently, Murota introduced an M-convex function as a quantitative generalization of the set of integral points in a base polyhedron, as well as an extension of valuated matroid over base polyhedron. Just as a base polyhedron can be transformed through a network, an M-convex function can be induced through a network. This paper gives an algorithmic proof for the induction of an M-convex f...
متن کامل